Astronomical Distance Determination Methods and the Light Travel Time Problem
نویسنده
چکیده
Some recent creationists have attempted to address the light travel time problem indirectly with an implied appeal to a small universe. If the universe is no more than a few thousand light years in size, then the light travel time is eliminated almost by definition. Here I survey the methods used for establishing astronomical distances. The only direct method of measuring stellar distances generally results in reliably measured distances of less than a thousand light years. However, that limit likely soon will exceed 6000 light years. Indirect methods already produce distances that are thousands, millions, and even billions of light years. The indirect distance determination methods ultimately are tied to direct determinations of distance, and they are reasonably consistent with one another. Furthermore the indirect methods are supported by well-understood physics. It is extremely unlikely that these methods are so wrong that the light travel time problem can be answered with
منابع مشابه
I.Derivation of the effect and radial motion
Context. Very precise planned space astrometric missions and recent improvements on imaging capabilities require a detailed review of the assumptions of classical astrometric modeling. Aims. We show that Light-Travel Time must be taken into account to model the kinematics of astronomical objects in nonlinear motion, even at stellar distances. Methods. A closed expression to include Light-Travel...
متن کاملDifferent Network Performance Measures in a Multi-Objective Traffic Assignment Problem
Traffic assignment algorithms are used to determine possible use of paths between origin-destination pairs and predict traffic flow in network links. One of the main deficiencies of ordinary traffic assignment methods is that in most of them one measure (mostly travel time) is usually included in objective function and other effective performance measures in traffic assignment are not considere...
متن کاملA hybrid meta-heuristic algorithm for the vehicle routing problem with stochastic travel times considering the driver's satisfaction
A vehicle routing problem is a significant problem that has attracted great attention from researchers in recent years. The main objectives of the vehicle routing problem are to minimize the traveled distance, total traveling time, number of vehicles and cost function of transportation. Reducing these variables leads to decreasing the total cost and increasing the driver's satisfaction level. O...
متن کاملSolving the Ride-Sharing Problem with Non-Homogeneous Vehicles by Using an Improved Genetic Algorithm with Innovative Mutation Operators and Local Search Methods
An increase in the number of vehicles in cities leads to several problems, including air pollution, noise pollution, and congestion. To overcome these problems, we need to use new urban management methods, such as using intelligent transportation systems like ride-sharing systems. The purpose of this study is to create and implement an improved genetic algorithms model for ride-sharing with non...
متن کاملThe Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem
This paper aims to study the locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating locomotives. This problem is assigning a fleet of locomotives to a network of trains to provide sufficient power to pull them from their origins to destinations by satisfying a rich set of operational con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013